package DoExercise.HSP_ZCY.A009_图结构.A001_并查集;

import java.util.ArrayList;

public class Node
{
    public int value;//点的描述，该字段也可以是A B C D 或 1 2 3 4等
    public int in;//有多少点指向
    public int out;//从该点指出多少
    public ArrayList<Node> nexts;//直接邻居点，从该点直接出发后的点
    public ArrayList<Edge> edges;//直接邻居边，从该点直接出发后的边
    
    public Node(int value)
    {
        this.value = value;
        in = 0;
        out = 0;
        nexts = new ArrayList<>();
        edges = new ArrayList<>();
    }
}
